Polynomial Differential-Based Information-Theoretically Secure Verifiable Secret Sharing
نویسندگان
چکیده
منابع مشابه
Information-theoretically Secure Strong Verifiable Secret Sharing
In a (t,n) secret sharing scheme, a mutually trusted dealer divides a secret into n shares in such a way that any t or more than t shares can reconstruct the secret, but fewer than t shares cannot reconstruct the secret. When there is no mutually trusted dealer, a (n,t,n) secret sharing scheme can be used to set up a (t,n) secret sharing because each shareholder also acts as a dealer to decide ...
متن کاملNon-Interactive and Information-Theoretic Secure Publicly Verifiable Secret Sharing
A publicly verifiable secret sharing scheme is more applicable than a verifiable secret sharing because of the property that the validity of the shares distributed by the dealer can be verified by any party. In this paper, we construct a non-interactive and informationtheoretic publicly verifiable secret sharing by a computationally binding and unconditionally hiding commitment scheme and zero-...
متن کاملUnconditionally Secure Verifiable Secret Sharing Scheme
Abstract A (t, n) secret sharing scheme permits a secret to be divided into n shares in such a way that any t or more than t shares can reconstruct the secret, but fewer than t shares cannot reconstruct the secret. Verifiable secret sharing (VSS) has been proposed to allow each shareholder to verify the validity of his own share, but not other shareholders' shares. In this paper, we propose an ...
متن کاملVerifiable Secret Sharing as Secure Computation
We present a stronger notion of veriiable secret sharing and exhibit a protocol implementing it. We show that our new notion is preferable to the old ones whenever veriiable secret sharing is used as a tool within larger protocols, rather than being a goal in itself.
متن کاملSpace-efficient Verifiable Secret Sharing Using Polynomial Interpolation
Secret sharing deals with the problem of securely distributing confidential information among a certain number of users, in such a way that only some subsets of them are able to jointly decrypt it. Several schemes and variants of secret sharing have been proposed, from the seminal schemes of Shamir and Blakley, which are based respectively on polynomial interpolation, and hyperplanes intersecti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Information Technology and Computer Science
سال: 2014
ISSN: 2074-9007,2074-9015
DOI: 10.5815/ijitcs.2014.12.03